Relational Lattice Axioms
نویسندگان
چکیده
Relational lattice is a formal mathematical model for Relational algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. We continue to investigate Relational lattice properties with emphasis onto axiomatic definition. New results include additional axioms, equational definition for set difference (more generally anti-join), and case study demonstrating application of the relational lattice theory for query transformations.
منابع مشابه
Relational Algebra as non-Distributive Lattice
We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.
متن کاملA Lattice Approach to Bayesian Networks
Bayesian networks and conditional independence is studied via functional dependences. Armstrongs axioms known from the theory of relational databases is used to reformulate the concept of Bayesian networks into the theory of join-semidistributive lattices. Lattice theory provides us with a richer language to discuss causation than graph theory does.
متن کاملRelational Lattice Foundation For Algebraic Logic
Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two directions. First, we uncover a pair of complementary lattice operators, and organize the model into a bilattice of four operations and four distinguished constants....
متن کاملBASE AXIOMS AND SUBBASE AXIOMS IN M-FUZZIFYING CONVEX SPACES
Based on a completely distributive lattice $M$, base axioms and subbase axioms are introduced in $M$-fuzzifying convex spaces. It is shown that a mapping $mathscr{B}$ (resp. $varphi$) with the base axioms (resp. subbase axioms) can induce a unique $M$-fuzzifying convex structure with $mathscr{B}$ (resp. $varphi$) as its base (resp. subbase). As applications, it is proved that bases and subbase...
متن کاملInformation Algebras and Consequence Operators
We explore a connection between different ways of representing information in computer science. We show that relational databases, modules, algebraic specifications and constraint systems all satisfy the same ten axioms. A commutative semigroup together with a lattice satisfying these axioms is then called an “information algebra”. We show that any compact consequence operator satisfying the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0807.3795 شماره
صفحات -
تاریخ انتشار 2008